A Common Solution of Equilibrium, Constrained Convex Minimization, and Fixed Point Problems
نویسندگان
چکیده
In this paper, we propose a new iterative scheme with the help of gradient- projection algorithm (GPA) for finding common solution an equilibrium problem, constrained convex minimization and fixed point problem. Then, prove some strong convergence theorems which improve extend recent results. Moreover, give numerical result to show validity our main theorem.
منابع مشابه
An Explicit Iterative Method for Finding a Common Solution of Equilibrium and Fixed Point Problems
We provide an iterative method for finding a common solution of a finite family of equilibrium problems and of a fixed point problem, and prove its strong convergence. Our method extends an implicit method of Colao, et al. (Nonlinear Anal. 71 (2009), no. 7-8, 2708-2715) to an explicit method (in the case of a single nonexpansive mapping).
متن کاملSome fixed point theorems and common fixed point theorem in log-convex structure
Some fixed point theorems and common fixed point theorem in Logarithmic convex structure areproved.
متن کاملCustomized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
This paper takes a uniform look at the customized applications of proximal point algorithm (PPA) to two classes of problems: the linearly constrained convex minimization problem with a generic or separable objective function and a saddle-point problem. We model these two classes of problems uniformly by a mixed variational inequality, and show how PPA with customized proximal parameters can yie...
متن کاملComposite Algorithms for Minimization over the Solutions of Equilibrium Problems and Fixed Point Problems
and Applied Analysis 3 Let C be a nonempty closed convex subset of a real Hilbert space H. Recall that a mapping A : C → H is called α-inverse strongly monotone if there exists a positive real number α such that 〈Ax − Ay, x − y〉 ≥ α‖Ax −Ay‖, for all x, y ∈ C. It is clear that any αinverse strongly monotone mapping is monotone and 1/α-Lipschitz continuous. Let f : C → H be a ρ-contraction; that ...
متن کاملOn Convergence Analysis of an Iterative Algorithm for Finding Common Solution of Generalized Mixed Equilibrium Problems and Fixed Point Problems
The purpose of this paper is to investigate nonemptyness of the solution set for generalized mixed quasi-equilibrium problems and investigate the asymptotic behavior of an iterative algorithm for finding common solution of generalized mixed equilibrium problems and fixed point problems of asymptotically nonexpansive mappings under mild conditions of iteration parameters. Our results improve and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tamkang Journal of Mathematics
سال: 2021
ISSN: ['0049-2930', '2073-9826']
DOI: https://doi.org/10.5556/j.tkjm.52.2021.3521